package com.origin.niuke.dynamic;

/**
 * NC228 判断子序列
 * 算法：动态规划
 *
 * @author yezh
 * @date 2022/12/5 22:01
 */
public class NC228 {

    public boolean isSubsequence(String S, String T) {
        // write code here
        int m = S.length(), n = T.length();
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (S.charAt(i - 1) == T.charAt(j - 1)) dp[i][j] = dp[i - 1][j - 1] + 1;
                else dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
        return S.length() == dp[m][n];
    }

}
